A tensor product formulation of Strassen's matrix multiplication algorithm
نویسندگان
چکیده
منابع مشابه
Design and Implementation of Long-Digit Karatsuba’s Multiplication Algorithm Using Tensor Product Formulation
Karatsuba’s multiplication algorithm uses three singledigit multiplications to perform one two-digit multiplication. If we apply Karatsuba’s multiplier recursively, it takes only 3 single-digit multiplications to multiply a pair of 2-digit numbers. This is a significant improvement compared to 4 single-digit multiplications using grade-school multiplier. In this paper, we will use tensor produc...
متن کاملVLSI Circuit Design of Matrix Transposition Using Tensor Product Formulation
Matrix transposition is a simple, but an important computational problem. It explores many key issues on data locality. In this paper, we will design matrix transposition algorithms on various interconnection networks for VLSI circuit design, including omega, baseline and hypercube networks. Since different interconnection networks have their own architectural characteristics and properties, an...
متن کاملMultiplication Modules and Tensor Product
All rings are commutative with identity and all modules are unital. The tensor product of projective (resp. flat, multiplication) modules is a projective (resp. flat, multiplication) module but not conversely. In this paper we give some conditions under which the converse is true. We also give necessary and sufficient conditions for the tensor product of faithful multiplication Dedekind (resp. ...
متن کاملA Note on Tensor Product of Graphs
Let $G$ and $H$ be graphs. The tensor product $Gotimes H$ of $G$ and $H$ has vertex set $V(Gotimes H)=V(G)times V(H)$ and edge set $E(Gotimes H)={(a,b)(c,d)| acin E(G):: and:: bdin E(H)}$. In this paper, some results on this product are obtained by which it is possible to compute the Wiener and Hyper Wiener indices of $K_n otimes G$.
متن کاملMatrix Multiplication : A Case Study of Algorithm
Modern machines present two challenges to algorithm engineers and compiler writers: They have superscalar, super-pipelined structure, and they have elaborate memory subsystems speciically designed to reduce latency and increase bandwidth. Matrix multiplication is a classical benchmark for experimenting with techniques used to exploit machine architecture and to overcome the limitations of conte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1990
ISSN: 0893-9659
DOI: 10.1016/0893-9659(90)90139-3